Shaping of multidimensional signal constella- tions using a lookup table

This paper describes a lookup table for the addressing of an optimally shaped constellation. The method is based on partitioning the subconstellations into shaping macro-shells of integer bit rate and increasing average energy. The macro-shells do not need to have an equal number of points. A lookup table is used to select a subset of the partitions in the cartesian product space. By devising appropriate partitioning / merging rules, we obtain suboptimum schemes of very low addressing complexity and small performance degradation. The performance is computed using the weight distribution of an optimally shaped constellation.